‘All the King's Horses and All the King's Men couldn't put Humpty-Dumpty Together Again’
نویسندگان
چکیده
منابع مشابه
Humpty Dumpty: Putting iBGP Back Together Again
Humpty Dumpty is the anthropomorphic nursery-rhyme egg broken into many pieces. Similarly, we have many pieces of measurement data to represent the current iBGP state. However, unlike the nurseryrhyme where the King’s men couldn’t put Humpty together again, we present a systematic approach to putting all the pieces of measured iBGP data together to obtain a more complete picture of a network’s ...
متن کاملThe "Humpty Dumpty Problem" in the Study of Early Cognitive Development: Putting the Infant Back Together Again.
In this article, I propose that the big question for the field of infant cognitive development is best characterized as the "Humpty Dumpty problem": Now that we have studied cognitive abilities in isolation, how do we put the developing cognitive system (and the infant) back together again? This problem is significant because cognitive abilities do not occur in isolation. Infants remember the i...
متن کامل"All the king's horses and all the king's men. . .".
This essay discusses an overlooked ingredient in the psychotherapy of psychosis which is termed the "curative audience." Central to the equation of psychological selfhood is the evocation of a sense of self by experiences that the patient has with objects in the environment. This essay calls attention to an essential function of this environment, namely, that it provides an audience that makes ...
متن کاملOn the 3-kings and 4-kings in multipartite tournaments
Koh and Tan gave a sufficient condition for a 3-partite tournament to have at least one 3-king in [K.M. Koh, B.P. Tan, Kings in multipartite tournaments, Discrete Math. 147 (1995) 171–183, Theorem 2]. In Theorem 1 of this paper, we extend this result to n-partite tournaments, where n 3. In [K.M. Koh, B.P. Tan, Number of 4-kings in bipartite tournaments with no 3-kings, Discrete Math. 154 (1996)...
متن کاملThe Complexity of Kings
A king in a directed graph is a node from which each node in the graph can be reached via paths of length at most two. There is a broad literature on tournaments (completely oriented digraphs), and it has been known for more than half a century that all tournaments have at least one king [Lan53]. Recently, kings have proven useful in theoretical computer science, in particular in the study of t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IDS Bulletin
سال: 1987
ISSN: 0265-5012,1759-5436
DOI: 10.1111/j.1759-5436.1987.mp18003008.x